Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3CA9295
Repositorysid.inpe.br/sibgrapi/2012/07.17.14.11
Last Update2012:07.17.14.11.48 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2012/07.17.14.11.48
Metadata Last Update2022:06.14.00.07.38 (UTC) administrator
DOI10.1109/SIBGRAPI.2012.18
Citation KeyAndalóTaubGold:2012:SoImPu
TitleSolving Image Puzzles with a Simple Quadratic Programming Formulation
FormatDVD, On-line.
Year2012
Access Date2024, Apr. 28
Number of Files1
Size4470 KiB
2. Context
Author1 Andaló, Fernanda A.
2 Taubin, Gabriel
3 Goldenstein, Siome
Affiliation1 Institute of Computing, Unicamp 
2 Divion of Engineering, Brown University 
3 Institute of Computing, Unicamp
EditorFreitas, Carla Maria Dal Sasso
Sarkar, Sudeep
Scopigno, Roberto
Silva, Luciano
e-Mail Addressfernanda@andalo.net.br
Conference NameConference on Graphics, Patterns and Images, 25 (SIBGRAPI)
Conference LocationOuro Preto, MG, Brazil
Date22-25 Aug. 2012
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2012-09-20 16:45:34 :: fernanda@andalo.net.br -> administrator :: 2012
2022-03-08 21:03:25 :: administrator -> menottid@gmail.com :: 2012
2022-03-10 12:49:21 :: menottid@gmail.com -> administrator :: 2012
2022-06-14 00:07:38 :: administrator -> :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsimage puzzle
jigsaw puzzle
image analysis
quadratic programming
AbstractWe present a new formulation to automatically solve jigsaw puzzles considering only the information contained on the image. Our formulation maps the problem of solving a jigsaw puzzle to the maximization of a constrained quadratic function that can be solved by a numerical method. The proposed method is deterministic and it can handle arbitrary rectangular pieces. We tested the validity of the method to solve problems up to 3300 puzzle pieces, and we compared our results to the current state-of-the-art, obtaining superior accuracy.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2012 > Solving Image Puzzles...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Solving Image Puzzles...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 17/07/2012 11:11 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3CA9295
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3CA9295
Languageen
Target File101289.pdf
User Groupfernanda@andalo.net.br
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SL8GS
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.03.31 5
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close